Block Sorting and Compression
نویسندگان
چکیده
The Block Sorting Lossless Data Compression Algorithm (BSLDCA) described by Burrows and Wheeler 3] has received considerable attention. It achieves as good compression rates as context-based methods, such as PPM, but at execution speeds closer to Ziv-Lempel techniques 5]. This paper, describes the Lexical Permutation Sorting Algorithm (LPSA), its theoretical basis, and delineates its relationship to BSLDCA. In particular we describe how BSLDCA can be reduced to LPSA and show how LPSA could give better results than BSLDCA when transmitting permutations. We also introduce a new technique, Inversion Frequencies, and show that it does as well as Move-to-Front (MTF) Coding when there is locality of reference in the data.
منابع مشابه
Text Compression using Recency Rank with Context and Relation to Context Sorting, Block Sorting and PPM*
Recently block sorting compression scheme was developed and relation to statistical scheme was studied, but theoretical analysis of performance has not been studied well. Context sorting is a compression scheme based on context similarity and it is regarded as an online version of the block sorting and it is asymptotically optimal. However, the compression speed is slower and the real performan...
متن کاملBlock Sorting Text Compression — Final Report
A recent development in text compression is a “block sorting” algorithm which permutes the input text according to a special sort procedure and then processes the permuted text with Move-to-Front and a final statistical compressor. The technique combines good speed with excellent compression performance. This report investigates the block sorting compression algorithm, in particular trying to u...
متن کاملImproving the Speed of LZ77 Compression by Hashing and Suffix Sorting
Two new algorithms for improving the speed of the LZ77 compression are proposed. One is based on a new hashing algorithm named two-level hashing that enables fast longest match searching from a sliding dictionary, and the other uses suffix sorting. The former is suitable for small dictionaries and it significantly improves the speed of gzip, which uses a naive hashing algorithm. The latter is s...
متن کاملExperiments with a Block Sorting Text Compression Algorithm
This report presents some preliminary work on a recently described “Block Sorting”lossless or text compression algorithm. While having little apparent relationship toestablished techniques, it has a performance which places it definitely among the best-known compressors. The original paper did little more than present the algorithm, withstrong advice for efficient implementation...
متن کاملThe Burrows-Wheeler Transform for Block Sorting Text Compression: Principles and Improvements
A recent development in text compression is a “block sorting” algorithm which permutes the input text according to a special sort procedure and then processes the permuted text with Move-to-Front and a final statistical compressor. The technique combines good speed with excellent compression performance. This paper investigates the fundamental operation of the algorithm and presents some improv...
متن کاملLossless and Near-Lossless Compression of Ecg Signals with Block-Sorting Techniques
In this work, we investigate the lossless and near-lossless compression of electrocardiogram (ECG) signals with different block-sorting transformations. We show that transformations with smaller context depths are a better choice for ECG signal compression when speed and memory utilization are considered. Further, we show that compression results of our proposed technique is better than other w...
متن کامل